Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
نویسندگان
چکیده
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs bits of p1, we use an oracle that gives only implicit information about p1. Namely, our oracle outputs a different N2 = p2q2 such that p1 and p2 share the t least significant bits. Surprisingly, this implicit information is already sufficient to efficiently factor N1, N2 provided that t is large enough. We then generalize this approach to more than one oracle query.
منابع مشابه
Further results on implicit factoring in polynomial time
In PKC 2009, May and Ritzenhofen presented interesting problems related to factoring large integers with some implicit hints. One of the problems is as follows. Consider N1 = p1q1 and N2 = p2q2, where p1, p2, q1, q2 are large primes. The primes p1, p2 are of same bit-size with the constraint that certain amount of Least Significant Bits (LSBs) of p1, p2 are same. Further the primes q1, q2 are o...
متن کاملImplicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, where q1,q2 are α-bit primes. We are given the implicit information that p1 and p2 share t most significant bits. We present a novel and rigorous lattice-based method that leads to the factorization of N1 and N2 in pol...
متن کاملAutomorphisms of Rings and Applications to Complexity
Rings are fundamental mathematical objects with two operations, addition and multiplication, suitably defined. A known way of studying the structure of rings is to consider automorphisms of rings. In my PhD thesis I consider finite dimensional rings represented in terms of their additive basis and study the computational complexity of various automorphism problems of rings in this representatio...
متن کاملP-schemes: a unifying framework for deterministic polynomial factoring over finite fields
We introduce a family of mathematical objects called P-schemes, generalizing the notions of association schemes andm-schemes [IKS09]. Based on these objects, we develop a unifying framework for deterministic polynomial factoring over finite fields under the generalized Riemann hypothesis (GRH). It allows us to not only recover most of the known results but also discover new ones. In particular,...
متن کاملA Simple and Improved Algorithm for Integer Factorization with Implicit Hints
Given two integers N1 = p1q1 and N2 = p2q2 with α-bit primes q1, q2, suppose that the t least significant bits of p1 and p2 are equal. May and Ritzenhofen (PKC 2009) developed a factoring algorithm for N1, N2 when t ≥ 2α+3; Kurosawa and Ueda (IWSEC 2013) improved the bound to t ≥ 2α+ 1. In this paper, we propose a polynomial-time algorithm in a parameter κ, with an improved bound t = 2α−O(log κ...
متن کامل